The domination game played on unions of graphs
نویسندگان
چکیده
منابع مشابه
The domination game played on unions of graphs
In a graph G, a vertex is said to dominate itself and its neighbors. The Domination game is a two player game played on a finite graph. Players alternate turns in choosing a vertex that dominates at least one new vertex. The game ends when no move is possible, that is when the set of chosen vertices forms a dominating set of the graph. One player (Dominator) aims to minimize the size of this se...
متن کاملPaired-Domination Game Played in Graphs
In this paper, we continue the study of the domination game in graphs introduced by Bre{v{s}}ar, Klav{v{z}}ar, and Rall. We study the paired-domination version of the domination game which adds a matching dimension to the game. This game is played on a graph $G$ by two players, named Dominator and Pairer. They alternately take turns choosing vertices of $G$ such that each vertex chosen by Domin...
متن کاملDomination games played on line graphs of complete multipartite graphs
The domination game on a graph G (introduced by B. Brešar, S. Klavžar, D.F. Rall [1]) consists of two players, Dominator and Staller, who take turns choosing a vertex from G such that whenever a vertex is chosen by either player, at least one additional vertex is dominated. Dominator wishes to dominate the graph in as few steps as possible, and Staller wishes to delay this process as much as po...
متن کاملA Nim game played on graphs
We propose a new impartial game played by two players, which can be compared to the well-known Nim game [1, 3, 4] played on graphs. In this paper, we consider this game and investigate its winning strategies. In the proof, Menger’s theorem [2] noted in graph theory plays a crucial role.
متن کاملDomination game played on trees and spanning subgraphs
The domination game, played on a graph G, was introduced in [3]. Vertices are chosen, one at a time, by two players Dominator and Staller. Each chosen vertex must enlarge the set of vertices of G dominated to that point in the game. Both players use an optimal strategy–Dominator plays so as to end the game as quickly as possible, Staller plays in such a way that the game lasts as many steps as ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2015
ISSN: 0012-365X
DOI: 10.1016/j.disc.2014.08.024